An efficient length- and rate-preserving concatenation of polar and repetition codes

نویسندگان

  • Mathis Seidl
  • Johannes B. Huber
چکیده

We improve the method in [1] for increasing the finite-lengh performance of polar codes by protecting specific, less reliable symbols with simple outer repetition codes. Decoding of the scheme integrates easily in the known successive decoding algorithms for polar codes. Overall rate and block length remain unchanged, the decoding complexity is at most doubled. A comparison to related methods for performance improvement of polar codes is drawn.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient secure channel coding scheme based on polar codes

In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...

متن کامل

An Efficient Construction and Low Complexity Collaborative Decoding of Reed-Solomon Concatenated with Modified Polar Codes

Polar codes are the first explicit code sequences that provably achieve capacity for discrete memory-less channels. However, their performance with successive cancellation (SC) decoding is unimpressive at practical block-lengths. In this paper, we propose a scheme of concatenating Reed-Solomon (RS) with modified polar codes to improve the performance of SC. Firstly, short repetition block codes...

متن کامل

Chapter 3 Coding Theorems for Convolutional Accumulate - m Codes

It is well-known that long random codes achieve reliable communication at noise levels up to the Shannon limit, but they provide no structure for efficient decoding. The introduction and analysis of Repeat Accumulate (RA) codes by Divsalar, Jin, and McEliece [10] shows that the concatenation of a repetition code and a rate-1 code, through a random interleaver, can also achieve reliable communic...

متن کامل

Rate-Compatible Polar Codes for Wireless Channels

A design of rate-compatible polar codes suitable for HARQ communications is proposed in this paper. An important feature of the proposed design is that the puncturing order is chosen with low complexity on a base code of short length, which is then further polarized to the desired length. A practical ratematching system that has the flexibility to choose any desired rate through puncturing or r...

متن کامل

Using concatenated algebraic geometry codes in channel polarization

Polar codes were introduced by Arikan [1] in 2008 and are the first family of error-correcting codes achieving the symmetric capacity of an arbitrary binary-input discrete memoryless channel under low complexity encoding and using an efficient successive cancellation decoding strategy. Recently, non-binary polar codes have been studied, in which one can use different algebraic geometry codes to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1312.2785  شماره 

صفحات  -

تاریخ انتشار 2013